Hardware Implementation of Greatest Common Divisor using subtractor in Euclid Algorithm
نویسندگان
چکیده
This paper proposed an efficient implementation of digital circuit based on the Euclidean Algorithm with modular arithmetic to find Greatest Common Divisor (GCD) of two Binary Numbers given as input to the circuit. Output of the circuit is the GCD of the given inputs. In this paper subtraction-based narrative defined by Euclid is described, the remainder calculation replaced by repeated subtraction. The selection of the Division Method using subtractor is due to ease of implementation and less complexity in connection with reduced hardware. The circuit is built using basic digital electronic components like Multiplexers & comparator (A<B) as control function and Registers, Full subtractor as Register transfer components. Although the circuit is developed to handle 4-bit of data, it can be easily extended to handle any number of bits just by increasing capacity of basic components (Multiplexer, Registers, Full Subtractor and comparator). General Terms GCD – Greatest Common Divisor
منابع مشابه
Multidimensional Greatest Common Divisor and Lehmer Algorithms
A class of multidimensional greatest common divisor algorithms is studied. Their connection with the Jacobi algorithm is established and used to obtain theoretical properties such as the existence of digit frequencies. A technique of D. H. Lehmer's for Euclid's algorithm is generalized for efficient computation of the multidimensional algorithms. For triples of integers, two algorithms of inter...
متن کاملOn the Frobenius Number of a Modular Diophantine Inequality
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b 6 x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
متن کاملComputational Number Theory and Applications to Cryptography
• Greatest common divisor (GCD) algorithms. We begin with Euclid’s algorithm, and the extended Euclidean algorithm [2, 12]. We will then discuss variations and improvements such as Lehmer’s algorithm [14], the binary algorithms [12], generalized binary algorithms [20], and FFT-based methods. We will also discuss how to adapt GCD algorithms to compute modular inverses and to compute the Jacobi a...
متن کاملOn a Parallel Extended Euclidean Algorithm
A new parallelization of Euclid’s greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel Oε(n/log n) time using only n processors on a Priority CRCW PRAM.
متن کامل